An Analogue of the Hilton-milner Theorem for Weak Compositions

نویسندگان

  • Cheng Yeaw Ku
  • Kok Bin Wong
  • BIN WONG
چکیده

Abstract. Let N0 be the set of non-negative integers, and let P (n, l) denote the set of all weak compositions of n with l parts, i.e., P (n, l) = {(x1, x2, . . . , xl) ∈ N0 : x1 + x2 + · · · + xl = n}. For any element u = (u1, u2, . . . , ul) ∈ P (n, l), denote its ith-coordinate by u(i), i.e., u(i) = ui. A family A ⊆ P (n, l) is said to be t-intersecting if |{i : u(i) = v(i)}| ≥ t for all u,v ∈ A. A family A ⊆ P (n, l) is said to be trivially t-intersecting if there is a t-set T of [l] = {1, 2, . . . , l} and elements ys ∈ N0 (s ∈ T ) such that A = {u ∈ P (n, l) : u(j) = yj for all j ∈ T}. We prove that given any positive integers l, t with l ≥ 2t + 3, there exists a constant n0(l, t) depending only on l and t, such that for all n ≥ n0(l, t), if A ⊆ P (n, l) is non-trivially t-intersecting, then

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A degree version of the Hilton-Milner theorem

An intersecting family of sets is trivial if all of its members share a common element. Hilton and Milner proved a strong stability result for the celebrated Erdős–Ko–Rado theorem: when n > 2k, every non-trivial intersecting family of k-subsets of [n] has at most (n−1 k−1 ) − (n−k−1 k−1 ) + 1 members. One extremal family HMn,k consists of a k-set S and all k-subsets of [n] containing a fixed el...

متن کامل

Erdös-Ko-Rado and Hilton-Milner Type Theorems for Intersecting Chains in Posets

We prove Erdős-Ko-Rado and Hilton-Milner type theorems for t-intersecting k-chains in posets using the kernel method. These results are common generalizations of the original EKR and HM theorems, and our earlier results for intersecting k-chains in the Boolean algebra. For intersecting k-chains in the c-truncated Boolean algebra we also prove an exact EKR theorem (for all n) using the shift met...

متن کامل

A Hilton-Milner Theorem for Vector Spaces

We show for k ≥ 3 that if q ≥ 3, n ≥ 2k + 1 or q = 2, n ≥ 2k + 2, then any intersecting family F of k-subspaces of an n-dimensional vector space over GF (q) with ⋂ F∈F F = 0 has size at most [ n−1 k−1 ] − qk(k−1) [ n−k−1 k−1 ] +qk. This bound is sharp as is shown by Hilton-Milner type families. As an application of this result, we determine the chromatic number of the corresponding q-Kneser gra...

متن کامل

Regular bipartite graphs and intersecting families

In this paper we present a simple unifying approach to prove several statements about intersecting and cross-intersecting families, including the Erdős–Ko–Rado theorem, the Hilton–Milner theorem, a theorem due to Frankl concerning the size of intersecting families with bounded maximal degree, and versions of results on the sum of sizes of non-empty cross-intersecting families due to Frankl and ...

متن کامل

TOPOLOGICALLY STATIONARY LOCALLY COMPACT SEMIGROUP AND AMENABILITY

In this paper, we investigate the concept of topological stationary for locally compact semigroups. In [4], T. Mitchell proved that a semigroup S is right stationary if and only if m(S) has a left Invariant mean. In this case, the set of values ?(f) where ? runs over all left invariant means on m(S) coincides with the set of constants in the weak* closed convex hull of right translates of f. Th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015